Fuzion • Library Modules • lock_free • container • Finger_Tree

container.Finger_Tree

Finger_Tree

type

)

ref

abstract_array T

[Contains abstract features]

[Private constructor]

[Module base]

[src]

A finger tree is a purely functional data structure designed
to efficiently represent persistent sequences.

It allows amortized constant time access to its elements.
Furthermore concatting (append/prepend) as well as splitting in logarithmic time.

In Fuzion finger trees are used for concatenation of strings and finite Sequences.

The paper introducing the datastructure:
https://www.cs.ox.ac.uk/ralf.hinze/publications/FingerTrees.pdf

The implementation that was used as an inspiration for this port:
https://github.com/ledbutter/CSharpFingerTree

NYI: UNDER DEVELOPMENT: split0, slice, reverse

Type Parameters

Any

[Module base]

[src]

Functions

group_hashable_by

type

property.hashable, f Unary K T)

container.Map K (Sequence T)

[Inherited from Sequence]

[src]

group the elements of this sequence by a key of type K

f determines the key of an element

0.095dev (GIT hash 174ff0d5a4465a8a0415fd934dc6963e69d62f22)

last changed: 2026-04-27